package Lee_code;

import java.util.Arrays;

public class Lee_674_2 {
    public int findLengthOfLCIS(int[] nums) {
        int len = nums.length;
        int[] dp = new int[len];
        Arrays.fill(dp, 1);
        for (int i=1; i<len; i++){
            if (nums[i]>nums[i-1])
                dp[i] = dp[i-1]+1;
        }
        return Arrays.stream(dp).max().getAsInt();
    }
}
